Method and apparatus for notifying a user of new data entered into an electronic system

ABSTRACT

A method of and apparatus for notifying a user of new data entered into an electronic system. The method includes formatting a searchable database into a directory tree structure, the directory tree structure includes nodes comprising related data and branches comprising links between the nodes. Each related data is categorized by one or more navigation paths through the directory tree structure and by one or more set parameters, the parameters being specific to the node in which the related data is included. The method accesses a discrete data item via a navigation path and one or more set parameters, sets a notification signal by saving the navigation path and one or more set parameters associated with the discrete data item within the electronic system, triggers the notification signal when a new data item is entered into the searchable database that matches the saved navigation path and set parameters, and notifies the user of new data entered into the electronic system in response to triggering the notification signal.

FIELD OF THE INVENTION

[0001] The invention relates to a method of notifying within anelectronic system. More particularly, the invention relates to a methodof notifying a user of new data entered into an electronic system.

BACKGROUND OF THE INVENTION

[0002] Information technology (IT) continues to rapidly evolve and withthis evolution comes advanced complexity. As new technologies areintroduced into enterprise networks, the need to interoperate the newtechnologies with existing legacy technologies becomes of greaterconcern and necessity. Enterprises are intrinsically multi-functional innature, yet applications and systems technologies tend to besingle-function entities with closed architectures and proprietaryinternals. This core incongruence results in disparate, incompatiblelegacy systems of various kinds, incompatible hardware systems anddevices, and heterogeneous platform systems mutually incomprehensible toeach other. This phenomenon has been referred to as EnterpriseApplication Dysintegration, or EAD. As a result, the function of IT ismore and more becoming the integration of heterogenous components.Currently, no automated means are available and the integration iseffected manually by human agents at great cost, time, and inefficiency.Indeed, with the implementation of a new technology, exists theunderstanding that in addition to implementation issues associatedsolely with the new technology comes the downtime, cost, and disruptionof re-architecting and re-building currently useful legacy functionalityassociated with integration.

[0003] With new applications and systems also comes associated new dataand information that needs to be stored and managed. Also comes the needto integrate legacy data for use by the new technologies. Disparatesystems inter-operate effectively through well defined interfaces. Tofacilitate this inter-operability, heterogeneous syntactic formats needto be translated into well known intermediary formats understood by allsystems in the exchange. This is often referred to as syntactictransformation, of which XML is being proposed as the universalintermediary for data exchange. Beyond syntax also lies the meaning ofterms, a problem commonly referred to as semantic reconciliation. Toaddress semantic reconciliation, a formal agreement is typically madebetween communicating systems about the meaning of terms in a particulardomain of knowledge and application.

[0004] There are many robust technologies for data-level integration,including database-specific Call Level Interfaces (CLIs), Open DataBaseConnectivity (ODBC), and Java DataBase Connectivity (JDBC). However,these interface technologies require sophisticated user knowledge andare quite tedious to implement and update.

[0005] Although there are database-to-database integration technologiescurrently available, there is no standard methodology for reusing legacyinformation with newly introduced technologies. A primary objective isto integrate systems and data without disturbing them. Minimizing anytype of data conversion plays to this concept of being non-invasive.

[0006] In addition to the problem of integrating new technologies withlegacy information is the problem of how to manage and access theexplosive growth in the amount of data. Increased memory and remoteelectronic data storage capacity offers access to large amounts of datain a very convenient form and physical size. Data may be available ondiskette, CD-ROM, magnetic tape, and on line to a centrally locatedcomputer and memory storage medium. On line access to such stored datais primarily provided by business data networks and the world wide web,hereinafter referred to as the Internet. By 1993, the Internet hadapproximately 130 sites that could be hyper-linked together withkeywords. The Internet has grown quickly since then. Sites on theInternet have increased from approximately 1.6 million at the end of1997 to 9.6 million at the end of 1999. Today, multiple technologies areavailable to access and manage data presented on the Internet. Thechallenge remains to extract information from the data simply andefficiently and to have confidence in the result that all relevant itemshave been uncovered. To focus in on relevant database records, searchengines generally use keywords, categorization, segment limitations,Boolean logic, and hit counts. More complex search engines can alsoemploy hierarchical categorization and multifaceted searching.

[0007] Keywords are the basis of most searches. A simple keyword search,such as that found in most word processors under the “Find” command,will locate the occurrence of a text string within a document or arecord. Misspellings, synonyms, or different tenses of a given textstring will not be located. The searcher must be cautious to truncatethe text string to a word's root. A search for the text string“graphical”, for instance, will not locate instances of the text string“graphics.” The searcher must also not choose commonly occurring words,as such a search would result in a high number of search results.Keywords are commonly combined with categorization, segment limitations,Boolean logic operators, advanced keywording, date operators and numericoperators to create a more effective search.

[0008] Categorization is a technique used to focus the scope of asearch. A category is a subset of records. By conducting a search onlywithin this subset of records, fewer irrelevant hits result.Lexis-Nexis™ and Dialog™, two online searchable databases withproprietary search engines, are examples of categorized databases. Priorto conducting a keyword search within the Lexis-Nexis™ or Dialog™database, the searcher must select from an extensive list of categories.Some categories are broader than others. If the searcher selects anoverly broad category, his or her search will result in too manyirrelevant hits and the searcher will waste time sorting through theundesired search result records looking for relevant hits. If thesearcher selects an overly narrow category, his or her search resultswill not include some of the desired records. Selection of anappropriate category, therefore, is of vital importance.

[0009] Searches can be further focused with the use of segmentlimitations. Such a search is also commonly referred to as a parametricsearch. “Segments” are similar to categories in that they are domainspecific. Category classifications are used to divide multiple recordsinto subsets, or “fields”. Segment classifications are used to divideindividual records into specific groupings of information. Usingsegments, or parameters, keyword searches can be targeted at certainfields of a record, such as a record's title or author. Search enginesdistributed by Lexis-Nexis™ and Dialog™, two online searchable databaseproviders, are well-adapted to such targeted searches, often usingdozens of segments for each category of records. A news article record,for instance, is typically broken down into separate fields for byline,date, publisher, abstract, and body. To find a news article with theword “elephant” in the title (or headline) using the classical interfaceof the Lexis-Nexis™ search engine, the following syntax would be needed:“HEADLINE(elephant)”.

[0010] Using keyword searching may not be very helpful if the user isnot familiar with the appropriate standard terminology related to theinformation they are looking for. Further, there may be many appropriateways to describe the information sought by the user. A concept expressedby a standard industry term in one industry may be different from astandard industry term in a different industry. A keyword search wouldrequire searching all synonyms used in order to ensure a complete andaccurate result.

[0011] When a user of a searching/retrieval system enters a keywordsearch query into a system, the query is parsed. Based on the parsedquery, a listing of documents relevant to the query is provided to theuser. In the prior art, it is also known to use semantic networks whenparsing a query. The number of words used to search the database is thenexpanded by including the corresponding words or associated wordsidentified by the semantic network in the search instructions. Thisexpansion can be based on any one or a combination of using stems orroots of terms, using sound-a-like words, using wildcard words or anyother appropriate semantic technique.

[0012] Boolean operators, such as “AND”, “OR” and “MINUS”, are used toenhance the capabilities of a search engine. The basic format of Booleanqueries is well known in the art and generally takes on the form of “XOR Y”, where X and Y are two distinct keywords. Because search requestsare processed by a computer, syntax rules must be strictly followed whendrafting a Boolean keyword search. In many search engines the logicaloperators “AND” and “OR” must be capitalized. Some search engines allowadditional syntax that indicates requisite proximity of keywords orhierarchy within a specific Boolean query. Hierarchy within a Booleanquery is usually designated with the use of parenthesis. The “(A OR B)AND (C OR D)” query, for instance, finds a first set of recordscontaining “A OR B” and a second set of records containing “C OR D”,then finds records included in both the first set and the second set.

[0013] Using the Boolean operator “AND” in a search expression such as“X AND Y,” will yield records which include both X and Y in the record.Using the Boolean operator “OR” in a search expression such as “X OR Y,”will yield records which include either X or Y in the record. Using theBoolean operator “MINUS” in a search expression such as “MINUS X” willyield records which do not include the term X in the record.

[0014] A query that is too narrow will result in less than the desirednumber of records. Correspondingly, a query that is too broad willresult in greater than the desired number of records. Immediate userfeedback on a specific query helps the searcher construct a bettersubsequent query. Hit count is perhaps the most effective form offeedback for constructing a better query. If a query is too narrow, thehit count will be very low, possibly even zero. If a query is too broad,the hit count will be very high. Hit count information is used withselected viewing of search results to alert the searcher of mistakes,such as incorrect category or segment choice, or otherwise assist thesearcher in drafting more effective queries. Hit counts are generallydisplayed after a given query is executed. Hit counts are more usefulwhen provided for each search term and each combination of search terms.Boolean Representation One, illustrated below in Table I, demonstrateshow individual hit counts can be used for the Boolean keyword search for“(cat OR dog) AND (doctor OR veterinarian)”. TABLE I BooleanRepresentation One

[0015] In the above example, the hit counts are as follows: in thedatabase the term “cat” is included in 280 records; in the database theterm “dog” is included in 494 records; in the database the term“veterinarian” is included in 34 records; in the database the term“doctor” is included in 194 records; in the database the term “cat” or“dog” is included in 774 records; in the database the term“veterinarian” or “doctor” is included in 228 records; and in thedatabase the Boolean query for the Boolean expression “(cat OR dog) AND(doctor OR veterinarian)” results in the location of 4 records. If theBoolean expression is altered by the replacement of “dog” with “cow”,the hit count change ripples through the Boolean expression'srepresentation as shown in Boolean Representation Two, illustrated belowin Table II. TABLE II Boolean Representation Two

[0016] Feedback from individual hit counts gives the searcher access toinformation normally hidden. Viewing individual hit counts, a searcheris better able to identify search terms that are too specific, toobroad, or misspelled.

[0017] An additional search tool is hierarchical categorization. Insteadof classifying records into separate categories, hierarchical categoriesclassify records into both broad groupings and progressively narrowergroupings. An example of hierarchical categorization is found inbiology, where organisms are organized, from broadest to narrowest, bykingdom, phylum, class, order, family, genus, and species. Hierarchicalcategorization is commonly used in conventional internet search engines,such as those found at the Yahoo!™ and Altavista™ websites. To findinformation about a specific topic, a search engine user navigates froma list of broad categories through an increasingly more specific list ofcategories. Once the first category is selected, a search enginetypically displays a lower level screen with another list ofalternatives. Such navigation continues down through the various menusof alternatives having decreasing priority levels. At any point of thecategory navigation, a keyword or Boolean search can be performed uponthe records in that category. Search results are only obtained fromrecords located within the category searched. Most search engines onlyallow searches in one category at a time. To search a second category,the searcher must navigate up the hierarchical category tree and thendown to the second category.

[0018] Multifaceted classification attempts to address the limits of thehierarchical categorization method. Instead of assigning a record to asingle category, multifaceted classification allows a record to belongto multiple categories. The multiple categories become part of arecord's description, along with standard information for the recordsuch as the title, the abstract (or keywords), the date, and author.Multifaceted classification improves the likelihood of locating relevantrecords. First, the searcher can take several different paths to locatethe same record. Using the analogy of books in a library, multifacetedclassification is able to place a single book on more than one shelf.Second, the multiple categories can be subjected to a Boolean query.Records relating to sports medicine could be found by searching forrecords included in both the sports category and the medicine category.

[0019] Boolean logic, segment limitations, hit counts, hierarchicalcategorization, and multifaceted classification help the searcher createmore effective queries, but at the cost of increased complexity. Ofteninstruction manuals or a software program's help menu must be consultedto draft a query. Dialog™, for instance, publishes a “Bluebook” thatcontains detailed lists of segment codes for each of their manydatabases. Lexis-Nexis™ goes so far as to provide free online access andtraining seminars for students to overcome their search engine's initiallearning curve.

[0020] New generations of technology and methodologies continue to bedeveloped to improve search accuracy and efficiency. Where onegeneration fails to meet all demands, another generation arises lookingto fill the gaps. Each generation has been partially effective, howeverno generation to date has been entirely effective. In most cases,current technology is a singular approach technique to access andorganize information, which at certain times is productive and efficientin accomplishing the intended task. However, all too frequently, theuser uncovers no positive search result or receives hundreds, andsometimes thousands, of end search results. In some instances onetechnology will yield no positive result while another will possiblysolve the research task. What is needed is an approach which allowsusers to employ a simplified means to access, organize, and manageinformation contained on the Internet and within business data systems.This approach should combine the best search methodologies on the marketto provide the most complete solution possible.

[0021] What is also needed is a methodology that takes existing, legacyinformation and allows users to redefine and reorganize the informationwithout requiring a data conversion thus improving the flow of data.

SUMMARY OF THE INVENTION

[0022] The invention is a method of and apparatus for notifying a userof new data entered into an electronic system. According to an aspect ofthe present invention, a method of notifying a user of new data enteredinto an electronic system includes the steps of formatting a searchabledatabase within the electronic system into a directory tree structure,wherein the directory tree structure includes nodes comprising relateddata and branches comprising links between the nodes, wherein eachrelated item of data is categorized by one or more navigation pathsthrough the directory tree structure and by one or more set parameters,wherein the parameters are specific to the node in which the relateddata is included, accessing a discrete data item via a navigation pathand one or more set parameters, setting a notification signal by savingthe navigation path and one or more set parameters associated with thediscrete data item within the electronic system, triggering thenotification signal when a new data item is entered into the searchabledatabase and one or the one or more navigation paths and the setparameters of the new data item match the navigation path and the setparameters saved according to the set notification signal, and notifyingthe user of new data entered into the electronic system in response totriggering the notification signal. The step of accessing a discretedata item can be performed utilizing a selective one or more searchmethodologies including keyword search, hierarchical tree search,dichotomous key search, and parametric search. The related data caninclude one or more of text, graphics, objects, links to other nodeswithin the directory tree structure, and links to web sites external tothe electronic system. The navigation path can be defined by a querylanguage string. The step of notifying the user can be performed by oneor more methods of notification including over a bulletin board, throughan e-mail message, as a news item directed to the user when the usernext accesses the electronic system, and on a desktop interface throughwhich the user is accessing the electronic system. The searchabledatabase can be distributed into more than one physical location. Thesteps of accessing a discrete data item, setting a notification signal,triggering the notification signal, and notifying the user can beperformed by a server. The method can include the step of establishingan internet connection with the server to access a discrete data item,set a notification signal, trigger the notification signal, and notifythe user. The internet connection is established with a computer systemat a remote location from the server. The method can include the step ofmaintaining a node by a node owner by appropriately adding and deletingrelated data to and from the node. The node owner maintains ownership ofthe corresponding node and all nodes that are linked beneath thecorresponding node within the directory tree structure.

[0023] According to another aspect of the present invention, anotification system for notifying a user of new data entered into anelectronic system includes a notification server configured to format asearchable database within the electronic system into a directory treestructure, wherein the directory tree structure includes nodescomprising related data and branches comprising links between the nodes,wherein each related item of data is categorized by one or morenavigation paths through the directory tree structure and by one or moreset parameters, wherein the parameters are specific to the node in whichthe related data is included, to access a discrete data item via anavigation path and one or more set parameters, to set a notificationsignal by saving the navigation path and one or more set parametersassociated with the discrete data item within the electronic system, totrigger the notification signal when a new data item is entered into thesearchable database and one of the one or more navigation paths and theset parameters of the new data item match the navigation path and theset parameters saved according to the set notification signal, and tonotify the user of new data entered into the electronic system inresponse to triggering the notification signal. The notification servercan access the discrete data item by utilizing a selective one or moresearch methodologies including keyword search, hierarchical tree search,dichotomous key search, and parametric search. The related data caninclude one or more of text, graphics, objects, links to other nodeswithin the directory tree structure, and links to web sites external tothe electronic system. The navigation path can be defined by a querylanguage string. The notification server can notify the user over abulletin board, through an e-mail message, as a news item directed tothe user when the user next accesses the electronic system, on a desktopinterface through which the user is accessing the electronic system, orany combination thereof. The searchable database can be distributed intomore than one physical location. The system can include an interfacecircuit coupled to the notification server to establish a connectionwith a computer system. The connection can be established with thecomputer system at a remote location from the interface circuit. Theconnection can be established with the remote computer system and theinterface circuit over the internet to allow users to access thenotification system, to access a discrete data item, to set and totrigger a notification signal, and to notify the user. The system caninclude a node owner for maintaining a node by appropriately adding anddeleting related data to and from the node. The node owner maintains thecorresponding node and all nodes that are linked beneath thecorresponding node within the directory tree structure.

[0024] According to yet another aspect of the present invention, anetwork of devices for notifying a user of new data entered into anelectronic system includes or more computer systems configured toestablish a connection with other systems, and a notification servercoupled to the one or more computer systems to format a searchabledatabase within the electronic system into a directory tree structure,wherein the directory tree structure includes nodes comprising relateddata and branches comprising links between the nodes, wherein eachrelated item of data is categorized by one or more navigation pathsthrough the directory tree structure and by one or more set parameters,wherein the parameters are specific to the node in which the relateddata is included, to access a discrete data item via a navigation pathand one or more set parameters, to set a notification signal by savingthe navigation path and one or more set parameters associated with thediscrete data item within the electronic system, to trigger thenotification signal when a new data item is entered into the searchabledatabase and one of the one or more navigation paths and the setparameters of the new data item match the navigation path and the setparameters saved according to the set notification signal, and to notifythe user of new data entered into the electronic system in response totriggering the notification signal. The notification server can accessthe discrete data item by utilizing a selective one or more searchmethodologies including keyword search, hierarchical tree search,dichotomous key search, and parametric search. The related data caninclude one or more of text, graphics, objects, links to other nodeswithin the directory tree structure, and links to web sites external tothe electronic system. The navigation path can be defined by a querylanguage string. The notification server can notify the user over abulletin board, through an e-mail message, as a news item directed tothe user when the user next accesses the electronic system, on a desktopinterface through which the user is accessing the electronic system, orany combination thereof. The searchable database can be distributed intomore than one physical location. The one or more computer systems andthe notification server can be coupled together over the internet toallow users to access the notification system, to access a discrete dataitem, to set and to trigger a notification signal, and to notify theuser. The network of devices can include a node owner for maintainingthe node by appropriately adding and deleting related data to and fromthe node. The node owner maintains the corresponding node and all nodesthat are linked beneath the corresponding node within the directory treestructure.

BRIEF DESCRIPTION OF THE DRAWINGS

[0025]FIG. 1 illustrates a block diagram of a database management andresearching system according to the preferred embodiment of the presentinvention.

[0026]FIG. 2 illustrates a block diagram of the internal components ofexemplary computer systems used to access the controller of thepreferred embodiment of the present invention.

[0027]FIG. 3 illustrates a flowchart showing the process used when auser accesses the keyword search module of the present invention.

[0028]FIG. 4 illustrates a flowchart showing the process used when auser accesses the hierarchical tree module of the present invention.

[0029]FIG. 5 illustrates a flowchart showing the process used when auser accesses the parametric search module of the present invention.

[0030]FIG. 6 illustrates a flowchart showing the process used when auser accesses the dichotomous key module of the present invention.

[0031]FIG. 7 illustrates a block diagram of the research module of thepresent invention.

[0032]FIG. 8 illustrates an exemplary encyclopedia page provided by theencyclopedia module of the present invention.

[0033]FIG. 9 illustrates a block diagram of the maintenance module ofthe present invention.

[0034]FIG. 10a illustrates the database management and research systemaccessing the searchable database.

[0035]FIG. 10b illustrates the accessing scheme of FIG. 10a aftermodifications to the directory tree structure.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT

[0036] The database management and research system of the presentinvention provides a real time interactive process to manage, redefine,reorganize, access, store, and retrieve information without a need toperform data conversion. The database management and research systempreferably provides a customizable directory tree structure thatfunctions with existing networks, security, and infrastructure. Thedirectory tree structure of the preferred embodiment of the presentinvention overlays and points to existing data thereby providing thenecessary management and access processes relative to the existing data.The directory tree structure preferably includes nodes which representhtml addresses and branches which represent links from an html addressof one node to an html address of another node. Since these processes donot require the need for data conversion, the present invention producesa cost savings by deferring the cost of a conversion and an improvedefficiency by reducing the overall time to implement a new databasemanagement and research technology.

[0037] A research system of the present invention bundles and enhancesfour database searching technologies to better manage and organizeinformation on the Internet or within an organization's own proprietarydata storage system. It will be clear to those skilled in the art thatthe source of such information can be stored locally, remotely,centrally or can be distributed across multiple storage systems. Thedatabase searching technologies utilized within the present inventioninclude keyword search, hierarchical tree, customizable parametricsearch, and dichotomous key. The utilization of the combination of thesedatabase searching technologies within the database management andresearch system of the present invention enables a user to retrieve veryspecific and categorized information.

[0038] Keyword searching is a standard utility used to scan a directoryor the content of documents. Many Internet users believe that allInternet searches follow this technique. A keyword, or keywords, searchcan be used to scan an entire directory of information sources or searchcomplete documents for a specific string or strings of characters.

[0039] A hierarchical tree structure is basically a decision treestructure that can have multiple nodes, like junctions of limbs on atree. This structure is similar to those used by Internet directories,such as Yahoo!™ or LookSmart™. A limitation with these technologies isthat they are not always designed to index discrete items ofinformation. As a result, the search may not contain descriptiveinformation about each item of interest.

[0040] Customizable parametric search technology allows users toprecisely locate desired information by searching the parametric datathat is contained within each node of the tree structure. Parameterswill include information type and target use of the information. Forexample, if a user is seeking a house of desired parameters (location,size, price, age), this search technique is reliable. The options forsearch topics and parameters are endless.

[0041] A dichotomous key structure is a binary key structure or two-nodetree. This structure is used as a decision tree mechanism to instructusers in deciphering information given in an answer or question dialog,often a yes or no answer. Examples of this include diagnosing a medicaldisease, diagnosing a mechanical problem, and working a system such asclassifying a biological species by physical attributes.

[0042] The database management and research system of the presentinvention improves research accuracy and provides data managementmethodology that reduces costs and the time users spend finding thedesired objective. As previously discussed, in most cases, currenttechnology is a singular approach technique. This singular approachtechnique is productive on occasion; however, all too frequently, theuser uncovers no positive result or receives an excessive number ofsearch results. In either case, had a different technology been employeda positive result may have been achieved. The research system of thepresent invention enables the user to quickly and easily jump from onetechnology to another to maximize the benefits of using multipleapproach techniques.

[0043] The database management and research system is a tool designedspecifically to manage information. It is designed to organize andco-ordinate all information contained within a database. As used herein,the term database refers to a single collection or database, eitherpreviously existing or generated, as well as a collection of multipledatabases, such as the Internet. It will also be obvious to someoneskilled in the art that the research system is capable of managingquantities of data both large and small as compared to the Internet. Theresearch system organizes this information into a coherent and orderlydata structure to allow simple retrieval of data within the database.The preferred data structure is a directory tree structure, which willbe described in detail below. This system also monitors changes to theinternal structures and communicates updates and additions of thisinformation structure to users in their chosen areas of interest. Withinthe research system, cross-links are utilized such that related nodesare explicitly linked as a “related topics” data structure within thedirectory tree. This is markedly different from other systems in thateach node of the tree can focus on more discrete topics of information,for example creating cross-links that are more discrete. In addition,the preferred embodiment of the research system converts from one of thefour basic search technologies to another, and then convert again toanother, while in the same search investigation. This providessignificant advantage over conventional single approach technologiesthrough improved search effectiveness and increased efficiency in bothtime and effort.

[0044] A block diagram of a researching system according to thepreferred embodiment of the present invention is illustrated in FIG. 1.A controller 10 includes an internet server 12, a research module 100, akeyword search module 300, an hierarchical tree module 500, a parametricsearch module 700, and a dichotomous key module 900. The research module100 is coupled to the internet server 12, to the keyword search module300, to the hierarchical tree module 500, to the parametric searchmodule 700, and to the dichotomous key module 900 to providecommunications between the controller 10 and users accessing theresearching system. As used herein, the term user includes one or moreof an individual, groups of individuals, association, corporation,agency, or any other person or entity accessing the researching systemto access, organize, retrieve, and manage information contained on theInternet and within a database.

[0045] The keyword search module 300, the hierarchical tree module 500,the parametric search module 700, and the dichotomous key module 900 areeach coupled to each other to enable the user to quickly and easily jumpfrom one search methodology to another while performing a research task.

[0046] The controller 10 is coupled to the public switched telephonenetwork 24 to allow communications between the internet server 12 andthe users' computer systems 26-32. Using the computer systems 26-32,users have the ability to establish a connection with the researchmodule 100 to perform a desired research task. Preferably, thisconnection is established between the users' computer systems 26-32 andthe controller 10 over the internet through the public switchedtelephone network 24. Alternatively, this connection is established byany appropriate connection including a direct connection over the publicswitched telephone network 24 or over a dedicated intranet network.

[0047] A block diagram of the internal components of the computersystems 26-32 used by users to access the controller 10 of the presentinvention is illustrated in FIG. 2. While the controller 10 can beaccessed from any appropriately configured computer system or internetaccess device, an exemplary computer system 50 for accessing thecontroller 10 is illustrated in FIG. 2. The exemplary computer system 50includes a CPU 72, a main memory 56, a video memory 60, a mass storagedevice 54 and a modem 52, all coupled together by a conventionalbidirectional system bus 58. The modem 52 is preferably coupled to thepublic switched telephone network 24 for sending and receivingcommunications. The mass storage device 54 may include both fixed andremovable media using any one or more of magnetic, optical ormagneto-optical storage technology or any other available mass storagetechnology. The system bus 58 contains an address bus for addressing anyportion of the memory 54, 56 and 60. The system bus 58 also includes adata bus for transferring data between and among the CPU 72, the mainmemory 56, the video memory 60, the mass storage device 54 and the modem52.

[0048] The computer system 50 is also coupled to a number of peripheralinput and output devices including the keyboard 68, the mouse 70, andthe associated display 66. The keyboard 68 is coupled to the CPU 72 forallowing a user to input data and control commands into the computersystem 50. A conventional mouse 70 is coupled to the keyboard 68 orcomputer system 50, directly, for manipulating graphic images on thedisplay 66 as a cursor control device in a conventional manner. Thedisplay 66 displays video and graphical images generated by the computersystem 50.

[0049] A port of the video memory 60 is coupled to a video multiplex andshifter circuit 62, which in turn is coupled to a video amplifier 64.The video amplifier 64 drives the display 66, when it is being used. Thevideo multiplex and shifter circuitry 62 and the video amplifier 64convert pixel data stored in the video memory 60 to raster signalssuitable for use by the display 66.

[0050] One advantage of the database management and research system ofthe present invention over conventional search techniques lies in theability of the research module 100 to run discrete searches, the abilityto separate information that is typically not able to be separated. Forexample, a computer hardware manufacturer would like to providepotential customers a way to answer questions regarding their products.Previously they were able to provide for a way that they could showproduct areas to their customers, but their site did not provide thefunctionality to search on more specific items. Using technologyprovided by the database management and research system of the presentinvention, users can locate information on discrete product part numbersso customers can obtain complete product information more quickly, andmake faster and more educated purchasing decisions.

[0051] The powerful discrete searching capability of the research systemcan be compared to a trip to a common grocery store. In a typicalsearching methodology you may have the ability to search by aisle. Theuser knows that they are looking for Del Monte™ string beans. Theirsearch takes them to the aisle of “canned fruits and vegetables”. Theymay be able to narrow their search, by using boolean logic, to thesection of the aisle where there are canned vegetables. Usingconventional means, it is now up to the user to search through thevarious types of vegetables to find specifically what they are lookingfor. However, the ability to locate discrete items within the researchsystem of the present invention will allow the user to go to the aisleof the “canned fruit and vegetables” and then continue refining thesearch. By utilizing dichotomous keys the engine will ask whether theuser is interested in “fruits” or “vegetables”. After choosingvegetables, the user may choose “beans” from a list of related topicscorn, beans, peas, etc. After choosing beans, the user may enter akeyword that they are searching for, e.g. “Del Monte”. They may continuethis type of questioning until finding the exact, discrete item thatthey are searching for.

[0052] The system ultimately provides a method for the user to retrieveinformation regardless of how specific. The user has multiple methods oflocating data: either via an encyclopedia interface, a multi-node treeclassification system, a decision tree dialog, via cross-links (relatedtopics), a keyword search system, or using parametric search attributes.

[0053] As previously discussed, the information within the researchsystem is organized into a directory tree structure. The directory treestructure includes nodes and branches. A node is considered a discretecategory. The nodes are collections of related data and branches arelinks between nodes. As used herein, the term data preferably refers toweb-based multimedia that includes sound, video, graphics, andappropriately formatted text. Appropriately formatted text can include,but is not limited to, word documents, excel documents, powerpointdocuments, mechanical drawings, and any document or file rendered by apersonal computer or a workstation. It should be clear to one skilled inthe art that data can also include discrete appropriately formatted andindependently accessible data items, files, and applications withassociated URLs and web interface stored in human resource databases,financial and accounting databases, manufacturing databases, orderprocessing and fulfillment databases, customer service databases, salesand marketing databases, and other similar databases or data fileformats. The top of the directory tree structure includes nodes of themost general type of information, whereas the bottom of the directorytree structure includes nodes of the most specific type of information.As a user moves down the directory tree structure, the nodes at a nextlower level will include more specific information than the nodes of theprevious higher level. The converse is also true, as a user moves up thedirectory tree structure, the nodes at the next higher level willinclude more general information than the nodes on the previous lowerlevel. As new information is added to the research system, the newinformation is assigned to a node. Each node preferably includes anencyclopedia listing, definition, related topics, and keywords. Nodesare also preferably cross-linked to related topics which enables usersto navigate laterally within the directory tree structure. As usersnavigate the directory tree structure, the display screen indicateswhere the users are within the directory tree structure and suggestsother related links. A more detailed description pertaining to constructand formation of the directory tree structure will be discussed below.

[0054] The research module 100 performs discrete research tasks usingany combination of the four search technologies including keywordsearch, hierarchical tree search, parametric search, and dichotomous keysearch, as discussed above. Such combinations can include one, two,three, or all four search technologies to accomplish any one researchtask. The specific embodiments of these combinations will be discussedin greater detail below.

[0055] Keyword Search Module

[0056] Referring to the keyword search module 300 in FIG. 1, the data inthe directory tree structure can be searched using the following keywordsearch options: search link descriptions, search keywords for nodes, andsearch contents of the link. In the search link descriptions search, thekeyword search module 300 will search only the descriptions of the linkobjects. In the search keywords for nodes search, the keyword searchmodule 300 searches the keywords located at each node of the directory.For example, searching for “car” will lead to the “automobiles” node inthe directory. In the search contents of the link search, the keywordsearch module 300 will traverse the directory down to each link path,and upload each page, object, or entire site and store the contents intothe search database. This database will be used for the content keywordsearch. The location within the directory will be stored with each linkin the search database in able to narrow the search down to the specificbranch of the directory.

[0057] Keyword searches selected at a location within the directory treestructure will only contain results from that node of the directory orbelow, the further down the directory tree, the narrower the search.

[0058] Applying the keyword search to the directory tree structureprovides many advantages over conventional search methodologies. Keywordsearches are available on multiple sets of data including treecategories that are specific to each tree node, topic descriptionsmaintained external to the web objects, and web page or object contentsearch. Using a keyword search within the directory tree structure keepsthe user within the tree as opposed to a link outside the system. Mostconventional searches provide a list of links and when the user choosesa link they are taken to that website, typically a website external tothe location at which the search was performed. With the research systemof the present invention, the user receives a list of matches but whenan item is selected the user is taken to a node on the directory treestructure or to the encyclopedia.

[0059] The concept is to include as much data as possible within thesystem as opposed to pushing the user outside the system via links toother websites. Although the research system does provide links toexternal web sites, the objective is to include enough data within theresearch system to enable the user to complete the research task withoutneed of linking to external web sites. Maintaining data within theresearch system controls performance and how clean the data is. Thisconcept applies to the entirety of the research system.

[0060] The keyword search technology utilizes a natural languageprocessor that maps the search request to the query language of theresearch system. A keyword search can be utilized at any point withinthe research task. To use the keyword search, first the user does a“find” operation. The user inputting the keyword(s) to be searched forinto a text field accomplishes a find. The keyword search module 300performs a fuzzy keyword search on all topics within the directory. Eachmatch will take the user to the node that matches the search criteria.Sometimes the result will be a list, i.e. you search on “tennis” and theresulting list might be “tennis”, “tennis shoes”, “tennis racquet”, etc.

[0061] A flowchart illustrating the process used when a user accessesthe keyword search module 300 is illustrated in FIG. 3. The process ofFIG. 3 starts at the step 302. At the step 305, the system presents aninput field to enter a search criteria. The input field is preferably atext field, but the input field can be any means by which the system canretrieve a keyword(s) to be used to perform a keyword search. At thestep 310, the user enters the keyword(s) to be used as the searchcriteria. The keyword(s) are entered into the text field presented inthe step 305. At the step 315, the research system performs the keywordsearch. The keyword search is performed by matching the search criteriathat was input at the step 310 to the data in the research system togenerate a list of matches. At the step 320, the research system liststhe search results, the search results are the list of matches generatedat the step 315. At the step 325, it is determined if the user wouldlike to view a result of the search. The user indicates the desire toview a result by selecting one of the results listed in the step 320.Preferably, the result is selected by using a computer mouse to“double-click” on the desired result in the conventional manner. If itis determined at the step 325 that the user does want to view a result,the process jumps to an encyclopedia module 130 (FIG. 7) at the step327. The encyclopedia module 130 formats the related data of theselected result into an encyclopedia-like page. The selected resultpreferably corresponds to a particular node within the directory treestructure. The encyclopedia page will be discussed in greater detailbelow. If it is determined at the step 325 that the user does not wantto view a result or after the system has accessed the encyclopediamodule 130, it is determined at the step 330 if the user wants toperform another keyword search. If it is determined at the step 330 thatthe user does want to perform another keyword search, then the processjumps back to the step 305. If it is determined at the step 330 that theuser does not want to perform another keyword search, then the keywordsearch process ends at the step 335.

[0062] Hierarchical Tree Module

[0063] Referring to the hierarchical tree module 500 in FIG. 1, eachnode within the directory tree structure is organized into ahierarchical tree structure, also commonly referred to as a directory.Directories are useful in situations of selecting from an alphabetizedlist. Simply list A through Z and the user chooses a specific letter. Adirectory corresponding to the specific letter chosen by the user ispresented. The user is once again allowed to choose a selection, and soon. Conventional directories are typically short on descriptions andsimply list available links.

[0064] Within the research system of the present invention, a directorypreferably has a title and short description with a collection of links.Combined with the encyclopedia, to be discussed below, a more robustlist including detail with text and graphics is provided.

[0065] A flowchart illustrating the process used when a user accessesthe hierarchical tree module 500 is illustrated in FIG. 4. The processof FIG. 4 starts at the step 502. At the step 506, the system displays adirectory of categories. The specific directory to be displayed isdependent upon the current node within the directory tree structure atwhich the user currently resides. If the user is at the highest node inthe directory, the main directory of categories is displayed. If theuser is at a lower node in the directory, the corresponding directory ofcategories for that node is displayed. At the step 510, it is determinedif the user wants to view a specific category. The user can select acategory from the directory of categories currently displayed from thestep 506. The user indicates the desire to view a category by selectingone of the categories listed in the step 506. If it is determined in thestep 510 that the user wants to view a category, the process jumps tothe encyclopedia model 130 (FIG. 7) at the step 511. The encyclopediamodule 130 formats the related data of the selected category into anencyclopedia-like page. After the process jumps to the encyclopediamodule 130, at the step 512 the system retrieves a subdirectory ofcategories. The subdirectory of categories is the directory ofcategories associated with the node of the category selected at the step510. At the step 514 the system displays the subdirectory of categories.At the step 518, it is determined if the user wants to view a specificcategory of the subdirectory of categories currently displayed from thestep 514. If it is determined at the step 518 that the user wants toview a category, then the process jumps back to the step 511 to jump tothe encyclopedia module 130. If it is determined at the step 518 thatthe user does not want to view a category or if it is determined at thestep 510 that the user does not want to view a category, then thehierarchical tree process ends at the step 522.

[0066] Parametric Search Module

[0067] Referring to the parametric search module 700 in FIG. 1, eachnode includes a list of parameters that are specific to that node. Thislist is customizable. For example, on a real estate website, search onprice, location, # bedrooms and you will be provided a list of entriesthat match all search criteria. When new information is added to theresearch system it is necessary to specify, or set, the value of eachparameter specific to each entry. The types of parameters include, butare not limited to, true-false, selected list, range of values, andalphabetic list.

[0068] Only certain users are granted permission to add new informationto the research system. The details as to how new information is addedto the research system will be discussed below. In an example of addingnew information, one parameter might be “type” and the choice of typemight be “white paper”, “article”, “book”, etc. The user will thenprovide which type the new item is. All parameters will be provided bythe user in this manner. Accordingly, at a particular node within thedirectory, a user can utilize a parametric search to further define andobtain only the desired information from the information available atthe node.

[0069] Each area in the directory tree structure provides differenttechnology. As a user moves down the tree, the technology provides morespecific information. For example, if a user is at a high node in thetree, such as “music”, and the user uses one of the four aforementionedsearch technologies to move down the tree, first to a mid-level node“classical music” and finally to a bottom node “Bach”. At the “Bach”node, the user can run a parametric search for specific items related to“Bach”.

[0070] A flowchart illustrating the process used when a user accessesthe parametric search module 700 is illustrated in FIG. 5. The processof FIG. 5 starts at the step 702. At the step 706 the system displays alist of parameters. The specific parameters to be displayed aredependent upon the node at which the user is located when the useraccesses the parametric search module 700. At the step 710, the userinputs the desired search parameters. It is preferred that the searchparameters are entered into a text field or selected from a drop-downmenu, although it should be apparent to someone skilled in the art thatother conventional means of data input can be used. In the step 714, theresearch system performs a search based on the input search parameterfrom the step 710. At the step 718, the research system displays a listof the matching results from the search performed in the step 714. Atthe step 722, it is determined if the user wants to view a result fromthe list of matching results displayed in the step 718. The userindicates the desire to view a matching result by selecting one of thematching results listed in the step 718. If it is determined at the step722 that the user wants to view a result, then the process jumps to theencyclopedia model 130 (FIG. 7) at the step 724. The encyclopedia module130 formats the related data of the selected result into anencyclopedia-like page. If it is determined at the step 722 that theuser does not want to view a result or after the system has accessed theencyclopedia module 130, it is determined at the step 726 if the userwants to perform another parametric search. If it is determined at thestep 726 that the user does want to perform another parametric search,then the process jumps back to the step 706. If it is determined at thestep 726 that the user does not want to perform another parametricsearch, then the parametric search process ends at the step 730.

[0071] Dichotomous Key Module

[0072] Referring to the dichotomous key module 900 in FIG. 1, thedirectory tree structure can be organized into a dichotomous key (binarykey) structure. Such a structure is advantageous because of itsflexibility for growth and ease of use. Flexibility for growth isaccomplished because node splits are made easily and can be done“on-line” while the system is running and also during other updates.Users are also less likely to notice a binary split verses a largersplit.

[0073] In conventional directory structures, where there are multipleentries per node, users can easily become lost. As directories grow andbecome more complicated, decisions become more difficult and choosingbetween two paths associated with a dichotomous key structure versesmany paths associated with directory structures is simpler. Therefore,the dichotomous tree structure improves ease of use for the user.

[0074] Dichotomous tree structures are not without their limitations,and as such, these limitations need to be accounted for. One problem ofa dichotomous key structure is that navigating this structure is morecumbersome when users are looking for simple topics on smallerdirectories such as shopping, entertainment, etc.

[0075] Another problem with dichotomous key structures is that someobjects are either ambiguous or not obvious as to which category or nodepath they belong. An example is the pepper. If the choice is betweenfruit and vegetable, to which does the pepper belong? The answer isfruit, but many may not know this.

[0076] The present invention addresses the problems associated with thedichotomous key structure by building a dichotomous decision tree withinthe directories of the directory tree structure. Such a structureenables users to break out of the dichotomous key at the correspondinglevel within the directory tree structure. This corresponding level istypically a specific node. At this specific node, doing keywordsearches, hierarchical tree searches, or parametric searches of varioustypes is restricted to that portion of the directory. The tree structurecan point to the same object via multiple paths which is valuable forobjects that have more than one category or use. Also, each nodecontains keywords for navigational help. These solutions, and others,will be discussed in greater detail below.

[0077] As is the case with the directory tree structure as a whole,within the dichotomous decision tree the higher the level the moregeneral the information. When navigating down a dichotomous keystructure, each lower node splits the knowledge base in half. If a userdoes break out of the tree to perform a keyword search, the search isperformed only on the remaining information below the node.

[0078] The dichotomous key structure uses a binary search and is goodfor use when the user is not familiar with what the lower end nodes are.For example, if the top node is medical diseases and bottom nodes arespecific medical diseases, a user makes binary decisions based onsymptoms to reach a diagnosis. The dichotomous key structure is alsoused in help desk environments to help end users solve problems, and inscientific classification. The dichotomous key structure is not so goodwhen nodes are obvious, i.e. top node is shoes and bottom nodes aretennis shoes, dress shoes, boots, etc. Dichotomous key is also not sogood in A-Z decisions. It would be tedious to make multiple decisionslike choosing between A-M and N-Z and so on to reach the desired letter.

[0079] An example of categories from general to specific within adichotomous key structure follows:

[0080]Everything→Organic→Vegetable→Plant→Tree→Evergreen→Tuber-Leaf→Juniper

[0081] Other examples of useful dichotomous key search applications are:at the node for “fiction”, the dichotomous key selections are “fictionbooks” and “fiction other than books”, or at the node for“Mercedes-Benz” and the dichotomous key selections are “Mercedes-BenzDealers” and “Mercedes-Benz Models”.

[0082] A flowchart illustrating the process used when a user accessesthe dichotomous key module 900 is illustrated in FIG. 6. The process ofFIG. 6 starts at the step 902. At the step 906 the system displays twobinary options, one of which is to be selected by the user. The specificbinary options to be displayed are dependent upon the node at which theuser is located within the dichotomous key structure. At the step 910,it is determined if the user wants to view either of the binary optionsdisplayed in the step 906. If it is determined at the step 910 that theuser does want to view one of the binary options, then the process jumpsto the encyclopedia module 130 (FIG. 7) at the step 912. Theencyclopedia module 130 formats the related data of the selected binaryoption into an encyclopedia-like page. If it is determined at the step910 that the user does not want to view either of the binary options orafter the system has accessed the encyclopedia module 130, it isdetermined at the step 914 if the user wants to select one of the twobinary options displayed in the step 906. By selecting one of the binaryoptions, the user is indicating that they want to move down one level inthe dichotomous key structure. The user indicates a desire to select oneof the binary options by double-clicking on one of the binary options inthe conventional manner. If it determined at the step 914 that the userwants to select a binary option, then at the step 918 the systemretrieves the next associated binary option pair, where the next binarypair resides at one level down the dichotomous key structure from thebinary option pair currently displayed in the step 906. After the step918, the process jumps back to the step 906. If it is determined at thestep 914 that the user does not want to select one of the two binaryoptions, then the dichotomous key process ends at the step 922.

[0083] Research Module

[0084] A block diagram of the research module 100 according to thepreferred embodiment of the present invention is illustrated in FIG. 7.The research module 100 includes a search module 110, a searchabledatabase 120, a maintenance module 180, the encyclopedia module 130, asave search module 140, a notification module 150, a query languagemodule 160, and an external systems module 170. The search module 110 iscoupled to the query language module 160 to format the search request ina query language that the research system can interpret. The searchmodule 110 is coupled to the encyclopedia module 130 to format thecollection of data corresponding to a specific node into anencyclopedia-like format. The search module 110 is coupled to thesearchable database 120 to access the available searchable data. Asdescribed above, the searchable database 120 can be local, remote,central or distributed across multiple storage systems. The searchabledatabase 120 can also include data accessible by the Internet or anintranet network. The maintenance module 180 is coupled to thesearchable database 120 to manage and organize new and existinginformation within the searchable database 120. The external systemsmodule 170 is coupled to the query language module 160 to provideexternal system access to the search module 110. The save search module140 is coupled to the search module 110 to save a navigation path andset parameters used in the search module 110 to perform a specificresearch task. The notification module 150 is coupled to the save searchmodule 140 to notify users that desired information has been added tothe searchable database 120.

[0085] The search module 110 performs the research task, the researchtask being accomplished by utilizing the search methodology specified bythe user. As discussed above, the search methodologies include keywordsearch, hierarchical tree, parametric search, and dichotomous key. Thesearch module applies the specified search methodologies to systemaccessible data to provide the desired search results. Preferably, theaccessible data resides in the searchable database 120.

[0086] The searchable database 120 includes data accessed by the searchmodule 110. Data within the searchable database 120 also includes linksto data external to the research system. In the preferred embodiment ofthe present invention, the searchable database 120 is a distributeddatabase which resides internal to the research system of the presentinvention. It should be clear to those skilled in the art that thesearchable database 120 can be a centralized database. It should also beclear to those skilled in the art that the searchable database 120 canreside external to the research system of the present invention.

[0087] The encyclopedia module 130 includes an encyclopedia. Each nodein the directory tree structure is linked to an encyclopedia page. Anencyclopedia page provides a description of product or data relevant tothe corresponding node that is managed by an author, business, ororganization. The information within the system, or data residing withinthe searchable database 120, is presented to users as an alphabeticallist of topics from which to choose. Listings can be expanded to revealgraphics and information. Listings can also be linked to createrelationships with listings on other encyclopedia pages. Links aresubmissions by users within the topic. This access method can eitherlead a user to the information required, or be a quick-start method toget to a specific area of information. Each node within the hierarchicalstructure and each link listed at each node of the tree has the abilityto store extended textual or html data. This allows information withinthe research system to be useable without users having to leave thesystem.

[0088] An exemplary encyclopedia page 810 provided by the encyclopediamodule 130 is illustrated in FIG. 8. The encyclopedia page 810corresponds to a Mercedes-Benz/Models/Roadsters node within thedirectory tree structure of the present invention. Although theencyclopedia page 810 corresponds to the Mercedes-Benz/Models/Roadstersnode, it should be clear that information within the directory treestructure can be re-organized in such a manner that the encyclopediapage 810 corresponds to a different node. The encyclopedia page 810includes a graphics section 820, a text section 830, a cross-linkssection 850, and an external links section 860. The graphics section 820includes gif, jpeg, mpeg or other appropriately formatted images andvideos. The text section 830 includes descriptive text, listings,definitions, etc. The cross-links section 850 includes links to otherrelated nodes within the directory tree structure. When a cross-link toanother node is selected, the encyclopedia page corresponding to thelinked node is displayed. In this manner, a user can jump fromencyclopedia page to encyclopedia page to encyclopedia page and so on.The external links section 806 includes links to related topics andsubject-matter that resides external to the directory tree structure.Preferably, these external links are URL's corresponding to externalwebsites. It should be clear that other relevant information can beincluded within the encyclopedia page 810. Although each section 820,830, 840, and 850 is illustrated as a single distinct section, it shouldbe clear that each section 820, 830, 840, and 850 can include multiplesimilar sections, where each section can be displayed anywhere withinthe encyclopedia page 810. It should also be clear that the encyclopediapage 810 can be opened as a stand-alone window or as a section of alarger window. In either case, the window can be larger than the displayscreen whereby the user can view the entire encyclopedia page byscrolling in the conventional manner.

[0089] The save search module 140 enables users to receive the mostcurrent and updated information on any topics of their choice. This isaccomplished by saving the navigation path through the directory treestructure and the set parameters of a search so that the exact samesearch can be done at any time. In this way users can also choose tohave new information sent to them regarding their chosen topic. Once theparameters have been saved, the same search can be performed again andagain, either at the time the search is saved or at a later date withparameters to be set such as the period between searches and thenotification method. The available notification methods include pushingthe search results to the desired user through email or othernotification as discussed below.

[0090] The user also has the capability of saving research criteriainside a personal profile similar to a “favorite”. This allows the userto repeat the search on a regular basis. Some examples of this repeatedsearch include a purchasing agent who wants to know the latest pricesposted within his/her areas of purchasing responsibilities and ascientist routinely researching his areas of expertise for newdevelopments.

[0091] The notification module 150 automatically distributes newlyentered information within a particular node or category of thedirectory tree structure to a user over the computer network. The userhas the ability to define nodes, categories and parameters ofinformation in which they are interested. When new information meetingthe defined criteria is entered into the decision tree or databasestructure, the system automatically forwards a notice of this newlyentered information to the user. This notice is forwarded by one or moremethods of notification including over a bulletin board, through ane-mail message, as a news item directed to the user when the user nextaccesses the directory, and on a desktop interface through which theuser is accessing the directory.

[0092] As a user is performing a research task, the search request, orprocedure, can be saved as described above in relation to the savesearch module 140. This saved search essentially defines a particularnode within the research system structure. Once the search procedure hasbeen saved, the user can request to be updated automatically with newinformation from the particular node of which the saved search defines.At each node, specific articles of information reside. As part of thenode, parameters are used to define each individual article ofinformation. As each new article of information is added to a particularnode, the parameters associated with that particular node are set tovalues that define the new article of information to be added. Theparameters are set by the user entering the new information into thesystem. The new information, along with its corresponding parameters,will need to be approved by a node owner before the new information isactually added to the system. This approval method will be discussed ingreater detail below. It is the setting of the parameters that enablesnew information to be “pushed” to other users who have previously saveda search in order to be automatically updated when desired newinformation is entered into the system. In other words, the pushfunctionality is performed in response to a saved search established bya specific user. When new or updated information is added to the nodeand this information matches the saved query selected by the user, theresearch system will notify the user of the added information. After anotification has been pushed to the appropriate user, this user acceptsthe push and establishes a method of receipt. The method of receiptincludes, but is not limited to, email, news groups, bulletin boards, ordesktop. It should be clear that other alternative methods to pushinformation to users are also available.

[0093] In conventional systems, push technology is not used withindirectories or search engines. The research system of the presentinvention makes it possible to apply push technology to directories andsearch engines due to the way that the search has been defined (by itsnavigation path and by its parameters) and the structure of the tree.

[0094] When a new item is entered into the system, the description ofthis item is propagated up the nodes of the tree so that no matter whatlevel of saved search the user has run, the user will know of anyrelevant new items entered into the system.

[0095] For example, certain Mercedes dealerships would like to receiveall factory announcements related to a particular model. Therefore, thenotification module 150 is utilized to push all announcements regardingthe particular model that are added to the database 120. Thenotification module 150 also can be used to push data to research sitesor to stockbrokers looking to stay abreast of a particular industry ortechnology.

[0096] The query language module 160 uses a specific query language tonavigate through the directory and decision tree to access a specificnode or a discrete data item within the directory. Each node within thedecision tree has a corresponding query that can be used to quicklyarrive at the node without manually navigating through the branches ofthe decision tree. The query can be further extended to access adiscrete data item corresponding to the specific node. A user has theability to save a query for a particular node or discrete data item tolater access information at the node without manually navigating throughthe branches of the decision tree to arrive at the node.

[0097] The structure of the query language of the present invention ispreferably similar to that of a specific query language (SQL), but it isspecific to the combined technologies of accessing the directory treestructure and setting parameters for a search. Therefore, theapplication of the query language is different than conventional searchmethodologies due to the unique directory tree structure of the databasemanagement and research system of the present invention.

[0098] In the present invention, all nodes are specific. This is nottypical of nodes in conventional directories. As an example, an“entertainment” node may be listed in multiple branches of conventionaldirectories, but within the research system of the present invention thenode is specific to a single branch. This specificity allows a query tobe performed that will find exactly what is being searched for. If thenode were listed in multiple branches, the same query would result inmultiple search results, which is not desired.

[0099] As an alternative to manually navigating the directory treestructure using the aforementioned search methodologies, the user hasthe option to input a query language string to define the research taskdesired of the research system. Inputting the query string yieldsequivalent results as does manually going through the directories, thetrees, and the parametric searches, as discussed above. Direct userinput of the desired query string essentially shortcuts the searchprocess. As is the case with the research tasks described above, thequery string can be saved as a save search. Whether a save search is aresult of manually navigating the directory tree structure or directlyinputting a desired query string, the research system saves the searchin the query language format.

[0100] The research system has the ability to interface with externalapplications through the external systems module 170. Interfacing isaccomplished utilizing the SQL-like query language as discussed above inrelationship to the query language module 160, an application programinterface (API), and a directory to directory protocol. The querylanguage is a third generation language to do simple queries to theresearch system. An example query looks like:

[0101] IQUERY <instance node>/<instance name> LIST * FROM <node key>

[0102] WHERE commercial=Y

[0103] AND LINK DESC CONTAINS “Chevrolet”;

[0104] The options for this query language contain READ functions andUPDATE functions.

[0105] The API within the external systems module 170 allows otherapplications, either external systems or web sites, to use the researchsystem as a central infrastructure knowledge base. The API systemcreates an interface between the application and the research systemthat allows a seamless connection to be made without users of theapplication noticing. The application can call upon resources containedinside the research system on the same server or across an IP connectionon similar networks or across the Internet. The external systems use theAPI to periodically or randomly query the research system forinformation, the queries are formatted in the query language asdescribed in the query language module 160. The application can make arequest to the research system for specific data from one or more nodeswithin the directory tree structure, the research system retrieves therequested data, the application pulls the retrieved data from theresearch system, the application reformats the retrieved data for thesystem on which the application resides, and the system utilizes theretrieved data as if the system itself retrieved and formatted the data.

[0106] The database management and research system of the presentinvention is designed so a separate portal can be set up within theresearch system that allows external search engines to search theresearch system directory tree structure and expose information to thesearch engine customers. As an example, an external system is a jobsearch site and the research system includes a multitude of job listingsorganized within a job directory tree structure. A user on the jobsearch site submits a request to find all the jobs within California,related to information technology (IT) with TCP/IP and SNA skills. Thejob search site system formats a query using the API of the researchsystem and forwards the request to the research system, the researchsystem retrieves the matching jobs, and the data is sent back to the jobsearch site system where it is formatted according to the job searchsite parameters. This entire process is accomplished transparently tothe job search site user. In this example, the research system providesthe back end functionality and the data is fed back to the job searchsite program running the API. It is transparent to the research systemthat the query originated from an external system.

[0107] The directory to directory protocol allows referrals from oneresearch system to be processed from another research system. Thisallows the research system to scale to larger proportions acrossmultiple organizations and data centers. One organization can maintaindata specific to its own expertise or ownership inside it's own hostedresearch system.

[0108] The maintenance module 180 manages the process of inputting anddeleting data into the searchable database 120. The maintenance module180 also manages relationships between data residing within thesearchable database 120. A block diagram of the maintenance module 180according to the preferred embodiment of the present invention isillustrated in FIG. 9. The maintenance module 180 includes a masternodal record module 182, a node links table module 184, an hierarchicalsecurity module 186, and a data maintenance module 188. The hierarchicalsecurity module 186 is coupled to the master nodal records module 182and the data maintenance module 188 to maintain the integrity of thedata associated with each node. The node links table module 184 iscoupled to the master nodal records module 182 to manage the linkingrelationships between the nodes in the research system.

[0109] The master nodal record module 182 maintains a record of the dataand links related to each individual node. As discussed above, each nodehas an associated encyclopedia page as described in relation to theencyclopedia module 130. Links at the node are attached to records inthe searchable database 120 or to the encyclopedia. If the link is to adiscrete data item, then the link is attached to the record in thesearchable database. If the link is to another node, then the link isattached to the encyclopedia and the associated encyclopedia page.

[0110] Each node in the directory tree structure includes data specificto that location of the tree. The data available preferably includesnode-name and node-description. The node-description is a detaileddescription of the tree node that explains to the user what the categoryis. Each node also includes related topics and search parameters. Thesetopics define a search, they are not just links.

[0111] The node links table module 184 maintains a node links table oflinks between all nodes within the directory tree structure. The linksbetween nodes are referred to as cross-links. At each level of thedirectory there is the possibility of one to many links (objects)available. A table linked in a “one to many” relationship is the “linkstable”. This table is where the object data is located that the user isinterested in locating. The table includes the fields link-node-name,link-description, and link-path. An example of the node links tableusage is herein described to navigate down the directory tree structureto “plants”. The node links table may include lists to academic websites on botany. Clicking on one of these entries will navigate the userto the external web sites to further research botany. To continue theexample, the user could continue down the directory tree structure. Thelower down the structure the user travels, the more specific and lessgeneral the categories become, and the more specific the links would be.If the user continued down the directory tree structure past “plants” to“juniper trees”, the links would be web or database objects such as websites, photos, movie files, etc., only pertaining to juniper trees.

[0112] Cross-links to related topics are also available. Objects arelinked to multiple categories inside the directory tree structure, sousers can also navigate laterally around the directory tree structure.

[0113] Many objects inside the directory tree structure belong correctlyinto more than one category. An example of this is the “pepper plant”.The “pepper plant” is correctly classified as a plant, a spice, a fruit,an edible plant, etc. This object is entered into the system into onenodal master record, as described above in relation to the master nodalrecord module 182, then entered into the directory at multiple locationswithin the tree. When navigating down through the edible plants, a userwill find the key for the “pepper plant.” A user will also find the keyfor the “pepper plant” when navigating down the spice section of thedirectory tree structure.

[0114] When a nodal master record is located in more than one locationin the directory tree structure, a cross-reference table record is addedto the node links table. When the object is located, the user has theoption of listing all other nodes (or categories) in which the object isalso contained.

[0115] This is an “Also Related Categories” function of the system. Whenthis function is accessed, typically by clicking on a related button onthe display, for the example of “pepper plant”, the other categories arelisted (plants, edible plants, spices, etc.). This gives the user theability to navigate laterally within the directory structure. The usercan find the “pepper plant” node, click on the “Also Related Categories”button, then select any of the other categories where the “pepper plant”is located and move to that location in the directory by selecting thatcategory.

[0116] Using cross-links there are multiple paths to the same data. Manyconventional search engines will list each path as a separate searchresult, which leads to cumbersome and repetitive results list. However,using the database management and research system of the presentinvention, a search result will preferably be listed only once so that auser does not have to wade through multiple search results which alllead back to the same data.

[0117] Additional data is stored about each link in the node linkstable. The additional data includes such data as family rating, linkrating, type, entertainment, and link hits. The family rating is arating similar to movie ratings, i.e. “G” is okay for the family, “R”maybe a little rough or risque, and “X” is pornography and inappropriatefor certain family members. The link rating is maintained by usersurveys and maintains a rating or popularity value for the link. Thetype is a link entry corresponding to categories such as Commercial,Private, or Educational. Entertainment can include games, activities,art, etc. Link hits represent a value maintained by the system andrecords the number of times users entered this site from the directorytree. The links hit value is used for recording how active and useful alink is.

[0118] An additional table linked in a “one to many” relationship is thenode keyword table. The node keyword table is maintained by the nodelinks table module 184 and includes keywords associated with aparticular node in the directory tree structure. The use of this tableis to help the system navigate the user directly to the node location.This gives the user the capability of navigating directly to thislocation in the tree with a simple keyword navigation, or with adirectory front-end structure or interface.

[0119] As an example, the user can enter “car” and navigate directly tothe “automobiles” section in the directory tree structure. The user canthen navigate the directory tree structure to the specific object thatthey are looking for, or enter another more specific keyword. A benefitof the database management and research system of the present inventionis when the more specific keyword is entered while the user is at the“automobile” node, the resulting search results will reflect matchesfound in the “automobile” node and the lower directory structure tied tothe “automobile” node.

[0120] The hierarchical security module 186 allows users to maintaintheir own data, or their own particular nodes of the tree. An expertwithin a particular field can “own” this node of the tree. This allowsfor the system to be maintained by any number of editors andcontributors with expertise or interest in their particular node(s). Thesystem is structurally designed to be able to split the tree intoadministrative and logical partitions. If necessary, these partitionscan span multiple computer nodes and multiple data centers overgeographical regions.

[0121] Ownership of portions of the directory tree structure can bedelegated to external authors or organizations. Organizations withownership of portions of the directory tree structure can furtherdelegate portions of their ownership to different authors inside theirorganization.

[0122] If a user wants to add a new item, the user must first be loggedinto the system. Certain users can be listed as “OK” and if these usersadd a new item, the item will automatically be entered into the systemwithout need for additional approval. Of course, the user must stillprovide the details regarding the new item's classification,corresponding parameters, etc. However, the item itself does not need tobe approved. If a user is not approved or is “unknown”, then the newitem will be put in a queue for review by the owner of the particularnode to which the user wants to add the item. The owner of the node willthen determine whether or not to add the new item to the system.Typically, if the database is the Internet or an Internet accessibledatabase, then each new item has an associated uniform resource locator(URL). The URL is considered new data and in essence acts as adirectory. Certain items will not have a URL, such as an announcement.For example, an announcement might be used by a user who wants to enteran item regarding a new book they wrote; however, if the user does nothave a web site associated with the new book, the user fills out theinformation associated with the new item, which includes somedescriptive text and search parameters. Only this information associatedwith the new item is then stored at the appropriate node.

[0123] Each node of the directory tree structure preferably includes alink to a user table. The user table includes a list of users authorizedfor update access to the node. The users with update access to the nodehave update access to the nodes below the specific node as well. Theuser with full authorization can also delegate update authority to usersat or below the directory tree structure where they have ownershiprights.

[0124] There are many examples where such update or ownershipauthorization is beneficial. For example, companies that produceproducts listed at the particular level of the directory and below.Educational organizations might take ownership of specific technologies,such as botany for plants, where the organization could research allbotany-related objects and maintain these links on a volunteer basis.Individual experts in a field or volunteers might maintain areas of thedirectory tree structure. In corporate Intranets, specific departmentsmaintain their own objects on the directory tree structure.

[0125] The hierarchical security module 186 enables node owners tocontrol the addition and deletion of data into the searchable database120. However, the nodes and associated content also need to bemaintained, which is a function of the data maintenance module 188.

[0126] Volunteers and special interest groups act to maintain the nodesand associated content. Maintenance preferably includes the need to ratecontent, match parameters, scan new items to eliminate spam, hate mail,etc., and scrub links to maintain the reliability of links. In corporateIntranets, individual authors or departments can maintain this structureand object links. If the reliability of a link is below a thresholdvalue the link can be eliminated. Such a reliability check is an exampleof business policies that can be set.

[0127] The data in the directory is manually entered and maintained. Forcontent on commercial web sites, users submit data into a holding queueto be reviewed before being released and added to the research system.The data maintenance module 188 performs up-front edits to insure datacompleteness and integrity.

[0128] One method by which new data is added is for the user to navigatethe directory tree structure to the correct location. At the correctlocation, the user selects an “add link” option. A set of forms ispresented to the user who will then fill in the data fields. For eachnew data item to be added, the user will also set the parameterscorresponding to the location within the directory tree structure towhich the new data item is to be added. These parameters are of the typedescribed above in relation to the parametric search. After the up-frontedits, the data is added or moved to the update queue, where the data isreviewed and released (or discarded). The user can navigate thedirectory tree structure again to add the same link to other locationswithin the directory. This is done by selecting the “add again toanother category” option, then navigating to the new location andselecting “add link” option as before. The system will “remember” thelink record and add the link to the current node record as well. Itshould be clear to those skilled in the art that other methods of dataentry are also available to be used to submit new information into theresearch system.

[0129] Once a user has accessed the research system, the user has theability to perform a research task and find desired information thatresides in the searchable database 120. The data in the searchabledatabase 120 is organized into a directory tree structure by theresearch system. At each branch in the tree is a node which includesrelated information. The higher the node is within the directory treestructure the more general the information, and the lower the node iswithin the directory tree structure the more specific the information.At each node within the tree, the user is presented with the option ofusing any one or combinations of the four search methodologies utilizedby the research system. The four search methodologies are keywordsearch, hierarchical tree search, dichotomous key search, and parametricsearch. Regardless as to which search methodology or searchmethodologies are used to reach a particular node, the user can utilizeany of the four search methodologies to further refine the search andmove further down the directory tree structure. The user may alsonavigate back up the directory tree structure to a higher node, and onceagain have the option to use any one of the four search methodologies torefine the search from the current node and move further down thedirectory tree structure. The related information at each node ispresented in the form of an encyclopedia page. Each node is linked to anencyclopedia page, where the encyclopedia page displays the relatedinformation associated with that particular node. Such relatedinformation can include a title, short description, text, graphics, andlinks to related topics. The links are typically to other nodes withinthe research system. However, the links may be to web sites external tothe research system. In this manner, a user can navigate the directorytree structure, utilizing any one of the four search methodologies inany combination to reach the desired result.

[0130] The following is an example of how all four search methodologiescan be utilized to successfully complete a research task. Afteraccessing the database management and research system, a user inputs thecharacter string “transportation” utilizing the keyword search option.The keyword search module then yields a list of search results includingthe node “transportation”. The user performs a hierarchical tree searchon “transportation” which results in a list including “airplane”,“automobile”, “boat”, “train”, etc. The user can then furtherinvestigate “automobile” by performing a dichotomous key search. Thedichotomous key search on “automobile” yields the two choices “foreign”and “domestic”. The user chooses “foreign” and the next dichotomous keysearch yields the two choices “specific car manufacturer” and “not aspecific manufacturer”. The user then performs a hierarchical search on“specific car manufacturer” that results in a list of foreign carmanufactures which includes BMW, Mercedes-Benz, Volvo, etc. The userperforms a dichotomous key search on “Mercedes-Benz” that yields the twochoices “Mercedes-Benz Dealers” and “Mercedes-Benz Models”. The userchooses “Mercedes-Benz Dealers” and the next dichotomous key searchyields the two choices “North American Dealerships” and “EuropeanDealerships”. The user chooses “North American Dealerships” and the nextdichotomous key search yields the two choices “west” and “east”. Theuser then performs a parametric search on “west” by inputting therelevant parameters to “object type”, “language”, and “family rating”.The parameters are selected from provided drop down menus. Additionalmeans for selecting parameters include listing items to be checked ornot checked. Such parameters to be checked include “technical document”,“commercial”, “recalls”, exclusive”, “OEM”, and “full service”. Uponselecting the desired parameters, the parametric search yields adiscrete list of dealerships that match the selected parameters. Byselecting a particular dealership from the list of dealerships, anencyclopedia page is displayed by the encyclopedia module. The displayedencyclopedia page corresponds to the selected dealership.

[0131] As discussed above, the research system provides searchtechniques and methodologies that enable users to navigate down adirectory tree structure for the purpose of performing a research taskand finding discrete information. The directory tree structure isorganized such that the upper levels include relatively more generalinformation and the lower levels include relatively more specificinformation. The research system also provides functionality thatenables the user to move back up the directory tree structure,preferably moving back up the directory one level at a time. In thisway, the user is able to navigate up and down the directory treestructure to perform the desired research task.

[0132] As discussed above, the database management and research systemof the present invention utilizes a directory tree structure to manageand access data within a searchable database. The directory treestructure is preferably customizable and is constructed using easy touse templates. An appropriately authorized user populates the templatesto generate the nodes and the branches between the nodes. In thepreferred embodiment, the nodes represent html addresses and thebranches represent links from an html address of one node to an htmladdress of another node. The html based format facilitates user accessof the system over the Internet or corporate intranet. As describedabove, the nodes include related data where data preferably refers toweb-based multimedia including sound, images, video, and appropriatelyformatted text. Appropriately formatted text can include, but is notlimited to, word documents, excel documents, powerpoint documents,mechanical drawings, and any document or file rendered by a personalcomputer or a workstation. It should be clear to one skilled in the artthat data can also include discrete appropriately formatted andindependently accessible data items, files, and applications withassociated URLs and web interface stored in human resource databases,financial and accounting databases, manufacturing databases, orderprocessing and fulfillment databases, customer service databases, salesand marketing databases, and other similar databases or data fileformats. The related data is not physically formatted within thedirectory tree structure. Instead, each data item is accessible throughappropriately formatted addresses including Uniform Resource Identifiers(URIs) and Uniform Resource Locators (URLs). Each node includesassociated pointers, where each pointer acts as a link, or points, froma specific node to a URL corresponding to a discrete data item withinthe searchable database. In this manner, the directory tree structureaccesses the discrete data item by utilizing the pointer that links thespecific node to the URL corresponding to the discrete data item.Defining the pointers is part of the directory tree structureconstruction process performed by the user. Through such a construct,the directory tree structure essentially overlays the searchabledatabase and groups related data items via the pointers. Each discretenode is a collection of pointers to the related data items. This overlaymethodology for accessing data is what enables the database managementand research system of the present invention to bypass the dataconversion process when utilizing the database management and researchsystem with an appropriately formatted existing database.

[0133] When constructing the directory tree structure, the user is ableto create as many nodes and branches as necessary. Once constructed, thenodes and branches can be edited or deleted by the corresponding nodeowners. Editing of a node includes adding a new pointer to a node orredirecting an existing pointer from accessing one data item toaccessing a different data item.

[0134]FIG. 10a illustrates an example of how the database management andresearch system of the present invention is utilized with an existingdatabase. The computer system 26 and the server controller 10 correspondto the like elements of FIG. 1. As in FIG. 1, the computer system 26 iscoupled to the server controller 10 preferably via the public switchedtelephone network. The searchable database 120 corresponds to thesearchable database 120 in FIG. 7. In FIG. 10a, the searchable database120 includes database 122, database 124, and database 126. Although thesearchable database 120 in FIG. 10a includes three databases, it shouldbe clear that the searchable database 120 can include any number ofdatabases. Server controller 10 is coupled to database 122 via a link123. In general, the link 123 represents a link between the controller10 and the database 122. In particular, the link 123 represents apointer corresponding to a specific node within the directory treestructure of the present invention, where the pointer directs thespecific node to a discrete data item residing within the database 122.As such, the link 123 can include any number of pointers where eachpointer directs a specific node within the directory tree structure to adiscrete data item within the database 122. Similarly, server controller10 is coupled to the database 124 and the database 126 via a link 125and a link 127, respectively. As with the link 123, the links 125 and127 can include any number of pointers, where a pointer represented bythe link 125 directs a specific node to a discrete data item residingwithin the database 124 and a pointer represented by the link 127directs a specific node to a discrete data item residing within thedatabase 126. A database 128 is coupled to the server controller 10 viaa link 131. The database 128 is external to the searchable database 120.As such, the directory tree structure does not directly overlay thedatabase 128 and therefore no pointers exist to direct a specific nodeto a discrete data item residing within the database 128. Although thedatabase 128 is illustrated as a single database, it should be clearthat the database 128 serves to represent any data not included withinthe searchable database 120.

[0135] As described above, the database management and research systemof the present invention provides links to data residing external to thesearchable database 120. Such a link is illustrated by the link 131 andalso by a link 129. The link 129 couples the database 124 to thedatabase 128. A discrete data item within the database 128 is accessedby the server controller 10 via the link 131. A specific node within thedirectory tree structure does not include a pointer which directs theparticular node to a discrete data item residing within the database128; instead, the specific node is linked via conventional means, as forexample a hypertext link that takes a user outside the system of thepresent invention by linking to a web server containing the discretedata item. Alternatively, the specific node includes a pointercorresponding to the link 125 that directs the specific node to adiscrete data item residing within the database 124. In turn, thediscrete data item residing within the database 124 includes aconventional link 129 directed to the discrete data item residing withinthe database 128, the link 129 takes the user outside the system of thepresent invention.

[0136] Nodes and branches can be added, edited, or deleted within thedirectory tree structure of the present invention. Such modificationsare made to the directory tree structure using the templates of thedatabase management and research system. FIG. 10b illustrates thedatabase management and research system of FIG. 10a after modificationsto the directory tree structure have been made. FIG. 10a illustrates thelink 131 representative of a hypertext link between a specific nodewithin the directory tree structure and a discrete data item residingwithin the database 128, the database 128 residing external to thesystem of the present invention. In FIG. 10b, the database 128 iscoupled to the server controller 10 via a link 133. By using thetemplates to edit the specific node, a pointer is added to the specificnode that now directs the specific node to the discrete data itemresiding within the database 128, thereby eliminating the need to linkthe specific node to the discrete data item via the conventional link131. By replacing the conventional link 131 with the pointer representedby the link 133, the user is no longer taken outside the system of thepresent invention to view the discrete data item. By staying within thesystem of the present invention, all or a portion of the discrete dataitem can be displayed within an encyclopedia page corresponding to thespecific node. If the user chooses to view the complete originaldiscrete data item, the user will then be taken out of the system viathe link 133 to the database 128. The added pointer is part of thedirectory tree structure and as such the directory tree structure nowoverlays the discrete data item represented by the database 128. Sincedata within the database 128 is now accessible by the overlaid directorytree structure, the database 128 is included within searchable database120, as illustrated in FIG. 10b.

[0137] The research system described above has been discussed in termsof a single directory tree structure; however, it should be apparentthat the research system of the present invention can be scaled toinclude multiple directory tree structures maintained at remote networklocations. Such scalability allows other organizations to maintainportions of the directory tree structure distinctly but allows thedirectory tree structure network to function as one logical system orsearchable database. By segmenting sections of the directory treestructure into different data centers, the research system essentiallybecomes a knowledge system where a user can find specific and relatedinformation. For example, a user can use the research system to diagnosea medical condition and find relevant information related to thatmedical condition. The user can also find related sites like clinics andmedicines available to treat the medical condition.

[0138] The present invention has been described in terms of specificembodiments incorporating details to facilitate the understanding ofprinciples of construction and operation of the invention. Suchreference herein to specific embodiments and details thereof is notintended to limit the scope of the claims appended hereto. It will beapparent to those skilled in the art that modifications may be made inthe embodiment chosen for illustration without departing from the spiritand scope of the invention. Specifically, it will be apparent to thoseskilled in the art that while the preferred embodiment of the presentinvention is accessible over the internet through the public switchedtelephone network, the present invention could also be accessible on anyother appropriate communication structures both wired and wireless,including cable, intranets, direct connections and the like.

We claim:
 1. A method of notifying a user of new data entered into anelectronic system comprising the steps of: a. formatting a searchabledatabase within the electronic system into a directory tree structure,wherein the directory tree structure includes nodes comprising relateddata and branches comprising links between the nodes, wherein eachrelated item of data is categorized by one or more navigation pathsthrough the directory tree structure and by one or more set parameters,wherein the parameters are specific to the node in which the relateddata is included; b. accessing a discrete data item via a navigationpath and one or more set parameters; c. setting a notification signal bysaving the navigation path and one or more set parameters associatedwith the discrete data item within the electronic system; d. triggeringthe notification signal when a new data item is entered into thesearchable database and one or the one or more navigation paths and theset parameters of the new data item match the navigation path and theset parameters saved according to the set notification signal; and e.notifying the user of new data entered into the electronic system inresponse to triggering the notification signal.
 2. The method as claimedin claim 1 wherein the step of accessing a discrete data item isperformed utilizing a selective one or more search methodologiesincluding keyword search, hierarchical tree search, dichotomous keysearch, and parametric search.
 3. The method as claimed in claim 1wherein the related data includes one or more of text, graphics,objects, links to other nodes within the directory tree structure, andlinks to web sites external to the electronic system.
 4. The method asclaimed in claim 1 wherein the navigation path is defined by a querylanguage string.
 5. The method as claimed in claim 1 wherein the step ofnotifying the user is performed by one or more methods of notificationincluding over a bulletin board, through an e-mail message, as a newsitem directed to the user when the user next accesses the electronicsystem, and on a desktop interface through which the user is accessingthe electronic system.
 6. The method as claimed in claim 1 wherein thesearchable database is distributed into more than one physical location.7. The method as claimed in claim 1 wherein the steps of accessing adiscrete data item, setting a notification signal, triggering thenotification signal, and notifying the user are performed by a server.8. The method as claimed in claim 7 further comprising the step ofestablishing an internet connection with the server to access a discretedata item, set a notification signal, trigger the notification signal,and notify the user.
 9. The method as claimed in claim 8 wherein theinternet connection is established with a computer system at a remotelocation from the server.
 10. The method as claimed in claim 1 furthercomprising the step of maintaining a node by a node owner byappropriately adding and deleting related data to and from the node. 11.The method as claimed in claim 10 wherein the node owner maintainsownership of the corresponding node and all nodes that are linkedbeneath the corresponding node within the directory tree structure. 12.A notification system for notifying a user of new data entered into anelectronic system comprising: a. means for formatting a searchabledatabase within the electronic system into a directory tree structure,wherein the directory tree structure includes nodes comprising relateddata and branches comprising links between the nodes, wherein eachrelated item of data is categorized by one or more navigation pathsthrough the directory tree structure and by one or more set parameters,wherein the parameters are specific to the node in which the relateddata is included; b. means for accessing a discrete data item via anavigation path and one or more set parameters; c. means for setting anotification signal by saving the navigation path and one or more setparameters associated with the discrete data item within the electronicsystem; d. means for triggering the notification signal when a new dataitem is entered into the searchable database and one of the one or morenavigation paths and the set parameters of the new data item match thenavigation path and the set parameters saved according to the setnotification signal; and e. means for notifying the user of new dataentered into the electronic system in response to triggering thenotification signal.
 13. The notification system as claimed in claim 12wherein the means for accessing a discrete data item is performedutilizing a selective one or more search methodologies including keywordsearch, hierarchical tree search, dichotomous key search, and parametricsearch.
 14. The notification system as claimed in claim 12 wherein therelated data includes one or more of text, graphics, objects, links toother nodes within the directory tree structure, and links to web sitesexternal to the electronic system.
 15. The notification system asclaimed in claim 12 wherein the navigation path is defined by a querylanguage string.
 16. The notification system as claimed in claim 12wherein the means for notifying the user is performed by one or moremethods of notification including over a bulletin board, through ane-mail message, as a news item directed to the user when the user nextaccesses the electronic system, and on a desktop interface through whichthe user is accessing the electronic system.
 17. The notification systemas claimed in claim 12 wherein the searchable database is distributedinto more than one physical location.
 18. The notification system asclaimed in claim 12 wherein the means for accessing a discrete dataitem, setting a notification signal, triggering the notification signal,and notifying the user are performed by a server.
 19. The notificationsystem as claimed in claim 18 further comprising means for establishingan internet connection with the server to access a discrete data item,set a notification signal, trigger the notification signal, and notifythe user.
 20. The notification system as claimed in claim 19 wherein theinternet connection is established with a computer system at a remotelocation from the server.
 21. The notification system as claimed inclaim 12 further comprising means for maintaining a node byappropriately adding and deleting data to and from the node.
 22. Thenotification system as claimed in claim 21 wherein the means formaintaining the node is performed by a node owner who maintains thecorresponding node and all nodes that are linked beneath thecorresponding node within the directory tree structure.
 23. Anotification system for notifying a user of new data entered into anelectronic system comprising a notification server configured to formata searchable database within the electronic system into a directory treestructure, wherein the directory tree structure includes nodescomprising related data and branches comprising links between the nodes,wherein each related item of data is categorized by one or morenavigation paths through the directory tree structure and by one or moreset parameters, wherein the parameters are specific to the node in whichthe related data is included, to access a discrete data item via anavigation path and one or more set parameters, to set a notificationsignal by saving the navigation path and one or more set parametersassociated with the discrete data item within the electronic system, totrigger the notification signal when a new data item is entered into thesearchable database and one of the one or more navigation paths and theset parameters of the new data item match the navigation path and theset parameters saved according to the set notification signal, and tonotify the user of new data entered into the electronic system inresponse to triggering the notification signal.
 24. The notificationsystem as claimed in claim 23 wherein the notification server accessesthe discrete data item by utilizing a selective one or more searchmethodologies including keyword search, hierarchical tree search,dichotomous key search, and parametric search.
 25. The notificationsystem as claimed in claim 23 wherein the related data includes one ormore of text, graphics, objects, links to other nodes within thedirectory tree structure, and links to web sites external to theelectronic system.
 26. The notification system as claimed in claim 23wherein the navigation path is defined by a query language string. 27.The notification system as claimed in claim 23 wherein the notificationserver notifies the user over a bulletin board, through an e-mailmessage, as a news item directed to the user when the user next accessesthe electronic system, on a desktop interface through which the user isaccessing the electronic system, or any combination thereof.
 28. Thenotification system as claimed in claim 23 wherein the searchabledatabase is distributed into more than one physical location.
 29. Thenotification system as claimed in claim 28 further comprising aninterface circuit coupled to the notification server to establish aconnection with a computer system.
 30. The notification system asclaimed in claim 29 wherein the connection is established with thecomputer system at a remote location from the interface circuit.
 31. Thenotification system as claimed in claim 30 wherein the connection isestablished with the remote computer system and the interface circuitover the internet to allow users to access the notification system, toaccess a discrete data item, to set and to trigger a notificationsignal, and to notify the user.
 32. The notification system as claimedin claim 23 further comprising a node owner for maintaining a node byappropriately adding and deleting related data to and from the node. 33.The notification system as claimed in claim 32 wherein the node ownermaintains the corresponding node and all nodes that are linked beneaththe corresponding node within the directory tree structure.
 34. Anotification system for notifying a user of new data entered into anelectronic system comprising: a. one or more computer systems configuredto establish a connection with other systems; and b. a notificationserver coupled to the one or more computer systems to format asearchable database within the electronic system into a directory treestructure, wherein the directory tree structure includes nodescomprising related data and branches comprising links between the nodes,wherein each related item of data is categorized by one or morenavigation paths through the directory tree structure and by one or moreset parameters, wherein the parameters are specific to the node in whichthe related data is included, to access a discrete data item via anavigation path and one or more set parameters, to set a notificationsignal by saving the navigation path and one or more set parametersassociated with the discrete data item within the electronic system, totrigger the notification signal when a new data item is entered into thesearchable database and one of the one or more navigation paths and theset parameters of the new data item match the navigation path and theset parameters saved according to the set notification signal, and tonotify the user of new data entered into the electronic system inresponse to triggering the notification signal.
 35. The network ofdevices as claimed in claim 34 wherein the notification server accessesthe discrete data item by utilizing a selective one or more searchmethodologies including keyword search, hierarchical tree search,dichotomous key search, and parametric search.
 36. The network ofdevices as claimed in claim 34 wherein the related data includes one ormore of text, graphics, objects, links to other nodes within thedirectory tree structure, and links to web sites external to theelectronic system.
 37. The network of devices as claimed in claim 34wherein the navigation path is defined by a query language string. 38.The network of devices as claimed in claim 34 wherein the notificationserver notifies the user over a bulletin board, through an e-mailmessage, as a news item directed to the user when the user next accessesthe electronic system, on a desktop interface through which the user isaccessing the electronic system, or any combination thereof.
 39. Thenetwork of devices as claimed in claim 34 wherein the searchabledatabase is distributed into more than one physical location.
 40. Thenetwork of devices as claimed in claim 34 wherein the one or morecomputer systems and the notification server are coupled together overthe internet to allow users to access the notification system, to accessa discrete data item, to set and to trigger a notification signal, andto notify the user.
 41. The network of devices as claimed in claim 34further comprising a node owner for maintaining the node byappropriately adding and deleting related data to and from the node. 42.The network of devices as claimed in claim 41 wherein the node ownermaintains the corresponding node and all nodes that are linked beneaththe corresponding node within the directory tree structure.